On the Conjugacy Problem in Certain Metabelian Groups
نویسندگان
چکیده
We analyze the computational complexity of the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups we prove that the conjugacy search problem is polynomial. We also show that for some of these groups the conjugacy search problem reduces to the discrete logarithm problem. We provide some experimental evidence which illustrates our results probabilistically.
منابع مشابه
METABELIAN SL(n,C) REPRESENTATIONS OF KNOT GROUPS
We give a classification of irreducible metabelian representations from a knot group into SL(n,C) and GL(n,C). If the homology of the n–fold branched cover of the knot is finite, we show that every irreducible metabelian SL(n,C) representation is conjugate to a unitary representation and that the set of conjugacy classes of such representations is finite. In that case, we give a formula for thi...
متن کاملSolving the Conjugacy Decision Problem via Machine Learning
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis on polycyclic and metabelian groups that are of interest to non-commutative cryptography. As a prototypical example, we utilize supervised learning methods to...
متن کاملUsing the Subgroup Membership Search Problem in Public Key Cryptography
There are several public key protocols around that use the computational hardness of either the conjugacy search problem or the word (search) problem for nonabelian groups. In this paper, we describe a cryptosystem whose security is based on the computational hardness of the subgroup membership (search) problem: given a group G, a subgroup H generated by h1, . . . , hk, and an element h ∈ H, fi...
متن کاملOn the Conjugacy Separability in the Class of Finite P -groups of Finitely Generated Nilpotent Groups
It is proved that for any prime p a finitely generated nilpotent group is conjugacy separable in the class of finite p-groups if and only if the tor-sion subgroup of it is a finite p-group and the quotient group by the torsion subgroup is abelian. 1. Let K be a class of groups. A group G is called residual K (or K-residual) if for each non-unit element a ∈ G there is a homomorphism ϕ of G onto ...
متن کاملThe Conjugacy Problem in Wreath Products and Free Metabelian Groups
1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.06503 شماره
صفحات -
تاریخ انتشار 2016